Computing biconnected components on a hypercube
نویسندگان
چکیده
منابع مشابه
An Incremental Distributed Algorithm for Computing Biconnected Components
This paper describes a distributed algorithm for computing the biconnected components of a dynamically changing graph. Our algorithm has a worst case communication complexity of O(b + c) messages for an edge insertion and O(b 0 + c) messages for an edge removal, and a worst case time complexity of O(c) for both operations, where c is the maximum number of biconnected components in any of the co...
متن کاملA Stabilizing Algorithm for Finding Biconnected Components
In this paper, a self-stabilizing algorithm is presented for finding biconnected components of a connected undirected graph on a distributed or network model of computation. The algorithm is resilient to transient faults, therefore, it does not require initialization. The proposed algorithm is based on stabilizing BFS construction and bridge-finding algorithms. Upon termination of these algorit...
متن کاملBacktracking Through Biconnected Components of a Constraint Graph
The algorithm presented here, BCC, is an enhancement of the well known Backtrack used to solve constraint satisfaction problems. Though most backtrack improvements rely on propagation of local informations, BCC uses global knowledge of the constraint graph structure (and in particular its biconnected components) to reduce search space, permanently removing values and compiling partial solutions...
متن کاملSpace-Efficient Biconnected Components and Recognition of Outerplanar Graphs
We present space-efficient algorithms for computing cut vertices in a given graph with n vertices and m edges in linear time using O(n + min{m, n log log n}) bits. With the same time and using O(n+m) bits, we can compute the biconnected components of a graph. We use this result to show an algorithm for the recognition of (maximal) outerplanar graphs in O(n log log n) time using O(n) bits.
متن کاملPath-based depth-first search for strong and biconnected components
Depth-first search, as developed by Tarjan and coauthors, is a fundamental technique of efficient algorithm design for graphs [23]. This note presents depth-first search algorithms for two basic problems, strong and biconnected components. Previous algorithms either compute auxiliary quantities based on the depth-first search tree (e.g., LOWPOINT values) or require two passes. We present one-pa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of Supercomputing
سال: 1991
ISSN: 0920-8542,1573-0484
DOI: 10.1007/bf00155859